Efficient crowd counting model using feature pyramid network and ResNeXt

نویسندگان

چکیده

Crowd counting is one of the most challenging issues in computer vision community for safety and security through surveillance systems. It has extensive range applications, such as disaster management, event detection, intelligence gathering analysis, public control, traffic monitoring, design spaces, anomaly detection military. Early approaches still encounter many like non-uniform density distribution, partial occlusion discrepancies scale perspective. To address above problems, feature pyramid networks are introduced deep convolution individuals crowd. The designed network extracted features at all resolutions constructed rapidly from only input image. This method achieves outperformance results compared to well-known on three standard crowd datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Mining for Localised Crowd Counting

Crowd counting in public places has a wide spectrum of applications especially in crowd control, public space design, and pedestrian behaviour profiling. Existing counting by regression methods, which aim to learn a direct mapping between low-level features and people count without segregation or tracking of individuals, can be categorised into either global approaches or local approaches. Glob...

متن کامل

Crowd Density and Counting Estimation Based on Image Textural Feature

This paper proposes an image textural analytical method for estimating the crowd density and counting. At first, the target detection is conducted to obtain the foreground image. This crowd image is used to calculate the gray level co-occurrence matrix (GLCM). Then, according to the characteristic values of the gray level co-occurrence matrix, i.e., energy, entropy, contrast, homogeneity, we us...

متن کامل

An Efficient Counting Network

We present a novel counting network construction, where the number of input wires w is smaller than or equal to the number of output wires t. The depth of our network is Θ(lg w), which depends only on w. In contrast, the amortized contention of the network depends on the number of concurrent processes n and the parameters w and t. This offers more flexibility than all previously known networks,...

متن کامل

Crowd Counting via Weighted VLAD on Dense Attribute Feature Maps

Crowd counting is an important task in computer vision, which has many applications in video surveillance. Although the regression-based framework has achieved great improvements for crowd counting, how to improve the discriminative power of image representation is still an open problem. Conventional holistic features used in crowd counting often fail to capture semantic attributes and spatial ...

متن کامل

The Counting Pyramid

A distributed counter is a concurrent object which provides a test-and-increment-operation on a shared value. On the basis of a distributed counter, one can implement various fundamental data structures, such as queues or stacks. We present a fast, linearizable counting scheme for processors that increment at arbitrary rates, the Counting Pyramid. We analyze the expected behaviour of the Counti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Soft Computing

سال: 2021

ISSN: ['1433-7479', '1432-7643']

DOI: https://doi.org/10.1007/s00500-021-05993-x